Lecture 17 : The Strong Exponential Time Hypothesis
نویسنده
چکیده
For SAT and CIRCUIT -SAT there is an obvious brute force algorithm that requires 2m time where n is the number of variables and m is a measure of the overall input size. How much better we can seems to depend on the input structure. In the case of kSAT there are some improvements. Theorem 1.1 (Paturi-Pudlak,Schöning,Paturi-Pudlak-Saks-Zane,Hertli). For constants 1 ≤ c ≤ 2, there are (randomized) algorithms for n variable k-SAT that run in time 2n(1−c/k).
منابع مشابه
Lecture 1 : Course Overview and Turing machine complexity
1. Basic properties of Turing Machines (TMs), Circuits & Complexity 2. P, NP, NP-completeness, Cook-Levin Theorem. 3. Hierarchy theorems, Circuit lower bounds. 4. Space complexity: PSPACE, PSPACE-completeness, L, NL, Closure properties 5. Polynomial-time hierarchy 6. #P and counting problems 7. Randomized complexity 8. Circuit lower bounds 9. Interactive proofs & PCP Theorem Hardness of approxi...
متن کاملLecture 10: Boosting and Margins
After T iterations we output the weighted majority hypothesis H(x) = sign( ∑T t=1 αtht(x)). Last time we saw that after T iterations, AdaBoost has training error at most exp(−2 ∑T t=1 γ 2 t ) where γt is the edge of hypothesis ht, γt = 1/2 − t. We also connected AdaBoost to an ERM problem with the exponential loss, and proved a generalization bound based on VC dimension. In particular we saw th...
متن کاملImproving Strong Exponential Time Hypothesis lower bounds for tree-like resolution
A Strong Exponential Time Hypothesis lower bound for resolution has the form 2(1− k)n for some k-CNF on n variables such that k → 0 as k → ∞. For every large k we prove that there exists an unsatisfiable k-CNF formula on n variables which requires tree-like resolution refutations of size at least 2 ( 1−Õ(k−1/3) ) . This improves the previous bound of 2(1−Õ(k −1/4))n due to Beck and Impagliazzo ...
متن کاملLecture 17 : March 24 Lecturer
In the previous lecture we defined Sufficient Statistics, which capture all information in the data relevant to estimating a desired parameter (hopefully, in a concise way). Motivated by the fact that useful sufficient statistics (i.e., those with dimension independent of sample size) only exist for certain (i.e., exponential family) distributions, we defined two more general notions, the Rate ...
متن کاملLower Bounds Based on the Exponential Time Hypothesis: Edge Clique Cover
In this article we survey algorithmic lower bound results that have been obtained in the field of exact exponential time algorithms and parameterized complexity under certain assumptions on the running time of algorithms solving CNF-Sat, namely Exponential time hypothesis (ETH) and Strong Exponential time hypothesis (SETH).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016